Spectral compression: Weighted principal component analysis versus weighted least squares
نویسندگان
چکیده
Two weighted compression schemes, Weighted Least Squares (wLS) and Weighted Principal Component Analysis (wPCA), are compared by considering their performance in minimizing both spectral and colorimetric errors of reconstructed reflectance spectra. A comparison is also made among seven different weighting functions incorporated into ordinary PCA/LS to give selectively more importance to the wavelengths that correspond to higher sensitivity in the human visual system. Weighted compression is performed on reflectance spectra of 3219 colored samples (including Munsell and NCS data) and spectral and colorimetric errors are calculated in terms of CIEDE2000 and root mean square errors. The results obtained indicate that wLS outperforms wPCA in weighted compression with more than three basis vectors. Weighting functions based on the diagonal of Cohen’s R matrix lead to the best reproduction of color information under both A and D65 illuminants particularly when using a low number of basis vectors.
منابع مشابه
A Least-Squares Unified View of PCA, LDA, CCA and Spectral Graph Methods
Over the last century Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA) and Spectral Clustering (SC) have been extensively used as a feature extraction step for modeling, classification, visualization, and clustering. This paper proposes a unified framework to formulate PCA, LDA, CCA, and SC as a ...
متن کاملA Unification of Component Analysis Methods
Over the last century Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), k-means and Spectral Clustering (SC) have been extensively used as a feature extraction step for modeling, classification, visualization and clustering. CA techniques are appealing because many can be formulated as eigen-prob...
متن کاملWeighted Majorization Algorithms for Weighted Least Squares Decomposition Models
For many least-squares decomposition models efficient algorithms are well known. A more difficult problem arises in decomposition models where each residual is weighted by a nonnegative value. A special case is principal components analysis with missing data. Kiers (1997) discusses an algorithm for minimizing weighted decomposition models by iterative majorization. In this paper, we propose a m...
متن کاملWeighted least squares methods for prediction in the functional data linear model
The problem of prediction in functional linear regression is conventionally addressed by reducing dimension via the standard principal component basis. In this paper we show that an alternative basis chosen through weighted least-squares, or weighted least-squares itself, can be more effective when the experimental errors are heteroscedastic. We give a concise theoretical result which demonstra...
متن کاملA Least-Squares Framework for Component Analysis (Under review for publication in PAMI)
Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Locality Preserving Projections (LPP), and Spectral Clustering (SC) have been extensively used as a feature extraction step for modeling, classification, visualization, and clustering. CA techniques are appealing because man...
متن کامل